An efficient second-order cone programming approach for optimal selection in tree breeding
نویسندگان
چکیده
منابع مشابه
Waveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملSecond-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملSecond Order Cone Programming Formulations for Feature Selection
This paper addresses the issue of feature selection for linear classifiers given the moments of the class conditional densities. The problem is posed as finding a minimal set of features such that the resulting classifier has a low misclassification error. Using a bound on the misclassification error involving the mean and covariance of class conditional densities and minimizing an L1 norm as a...
متن کاملA second order cone programming approach for semi-supervised learning
Semi-supervised learning (SSL) involves the training of a decision rule from both labeled and unlabeled data. In this paper, we propose a novel SSL algorithm based on the multiple clusters per class assumption. The proposed algorithm consists of two stages. In the first stage, we aim to capture the local cluster structure of the training data by using the k-nearest-neighbor (kNN) algorithm to s...
متن کاملOptimal Magnetic Shield Design with Second-Order Cone Programming
In this paper, we consider a continuous version of the convex network flow problem which involves the integral of the Euclidean norm of the flow and its square in the objective function. A discretized version of this problem can be cast as a secondorder cone program, for which efficient primal-dual interior-point algorithms have been developed recently. An optimal magnetic shielding design prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2018
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-018-1229-y